HCPO: an efficient insertion order for incremental Delaunay triangulation

ved. Among the five flavors [15] of sequential 2D Delaunay triangulation algorithms, incremental insertion methods (e.g., [8]) are most popular mainly because they are potentially dynamic, simple to implement and easy to be generalized to higher dimensions. However, normally they are not regarded as among the fastest methods. The basic principle of constructing Delaunay triangulation (DT) by incremental insertion is well known (see textbooks such as [2] for detail). A point is inserted into the triangulation in two steps: point location to finds the triangle or component of the triangle in which the point lies, and triangulation update to restore the Delaunay property of the triangulation. Point location is dominated by an orientation (nor-